Stationarity of Matrix Relevance Learning Vector Quantization
نویسنده
چکیده
We investigate the convergence properties of heuristic matrix relevance updates in Learning Vector Quantization. Under mild assumptions on the training process, stationarity conditions can be worked out which characterize the outcome of training in terms of the relevance matrix. It is shown that the original training schemes single out one specific direction in feature space which depends on the statistical properties of the data relative to the approached prototype configuration. Appropriate regularization terms can be used to favor full rank relevance matrices and to prevent oversimplification effects. The structure of the stationary solution is derived, giving insight into the influence of the regularization parameter. Machine Learning Reports,Research group on Computational Intelligence, http://www.uni-leipzig.de/̃compint Stationarity of Matrix Relevance Learning Vector Quantization
منابع مشابه
Learning Matrix Quantization and Variants of Relevance Learning
We propose an extension of the learning vector quantization framework for matrix data. Data in matrix form occur in several areas like gray-scale images, time dependent spectra or fMRI data. If the matrix data are vectorized, important spatial information may be lost. Thus, processing matrix data in matrix form seems to be more appropriate. However, it requires matrix dissimilarities for data c...
متن کاملRegularization in Relevance Learning Vector Quantization Using l one Norms
We propose in this contribution a method for l1-regularization in prototype based relevance learning vector quantization (LVQ) for sparse relevance profiles. Sparse relevance profiles in hyperspectral data analysis fade down those spectral bands which are not necessary for classification. In particular, we consider the sparsity in the relevance profile enforced by LASSO optimization. The latter...
متن کاملRegularization in relevance learning vector quantization using l1-norms
We propose in this contribution a method for l1-regularization in prototype based relevance learning vector quantization (LVQ) for sparse relevance pro les. Sparse relevance pro les in hyperspectral data analysis fade down those spectral bands which are not necessary for classi cation. In particular, we consider the sparsity in the relevance pro le enforced by LASSO optimization. The latter one...
متن کاملSparse Functional Relevance Learning in Generalized Learning Vector Quantization
Relevance learning in learning vector quantization is a central paradigm for classi cation task depending feature weighting and selection. We propose a functional approach to relevance learning for highdimensional functional data. For this purpose we compose the relevance pro le by a superposition of only a few parametrized basis functions taking into account the functional character of the dat...
متن کاملBiomedical Applications of Prototype Based Classifiers and Relevance Learning
In this contribution, prototype-based systems and relevance learning are presented and discussed in the context of biomedical data analysis. Learning Vector Quantization and Matrix Relevance Learning serve as the main examples. After introducing basic concepts and related approaches, example applications of Generalized Matrix Relevance Learning are reviewed, including the classification of adre...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009